Semaphore primitives and starvation-free mutual exclusion

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

A Starvation-Free Solution to the Mutual Exclusion Problem

With three or more cyclic processes competing for the critical section, however, there is a danger of individual starvation when the Pand V-operations are so-called ‘weakly implemented’. When the semaphore operations are weakly implemented and a V(m) is executed, which process is allowed to proceed is left undefined when two or more processes are blocked by P(m). .As a result, there is a danger...

One-sided Mutual Exclusion A new Approach to Mutual Exclusion Primitives

Todays operating systems are designed to manage multiple processes within uniprocessor systems, within several processors and even within distributed computer systems. Fundamental to this design is concurrency, especially mutual exclusion of multiple processes. All mutual exclusion techniques so far are designed to bother all involved processes. The first part of this paper shows an overview of...

Local-spin Mutual Exclusion Using Fetch-and- Primitives

We present a generic fetch-and-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is \generic" in the sense that it can be implemented using any fetch-andprimitive of rank 2N , where N is the number of processes. The rank of a fetch-andprimitive is a notion introduced herein; informally, it expresses the extent ...

Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives